Globally convergent block-coordinate techniques for unconstrained optimization
نویسندگان
چکیده
منابع مشابه
A globally convergent trust-region algorithm for unconstrained derivative-free optimization
In this work we explicit a derivative-free trust-region algorithm for unconstrained optimization based on the paper (Computational Optimization and Applications 53: 527–555, 2012) proposed by Powell. The objective function is approximated by quadratic models obtained by polynomial interpolation. The number of points of the interpolation set is fixed. In each iteration only one interpolation poi...
متن کاملGlobally convergent evolution strategies for constrained optimization
In this paper we propose, analyze, and test algorithms for constrained optimization when no use of derivatives of the objective function is made. The proposed methodology is built upon the globally convergent evolution strategies previously introduced by the authors for unconstrained optimization. Two approaches are encompassed to handle the constraints. In a first approach, feasibility is firs...
متن کاملParticle Swarm Optimization: Efficient Globally Convergent Modifications
In this paper we consider the Particle Swarm Optimization (PSO) algorithm [10, 7], in the class of Evolutionary Algorithms, for the solution of global optimization problems. We analyze a couple of issues aiming at improving both the effectiveness and the efficiency of PSO. In particular, first we recognize that in accordance with the results in [5, 6], the initial points configuration required ...
متن کاملNonlinear coordinate transformations for unconstrained optimization I. Basic transformations
In this two-part article, nonlinear coordinate transformations are discussed to simplify unconstrained global optimization problems and to test their unimodality on the basis of the analytical structure of the objective functions. If the transformed problems are quadratic in some or all the variables, then the optimum can be calculated directly, without an iterative procedure, or the number of ...
متن کاملAccelerated Block-coordinate Relaxation for Regularized Optimization
We discuss minimization of a smooth function to which is added a regularization function that induces structure in the solution. A block-coordinate relaxation approach with proximal linearized subproblems yields convergence to stationary points, while identification of the optimal manifold (under a nondegeneracy condition) allows acceleration techniques to be applied on a reduced space. The wor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Methods and Software
سال: 1999
ISSN: 1055-6788,1029-4937
DOI: 10.1080/10556789908805730